First-Order Atom Definitions Extended
نویسندگان
چکیده
We extend the notion of atom definitions in first-order formulae by guards. These are conditions restricting the atom definition in a form that frequently occurs in many application areas of automated theorem proving. We give a sufficient and complete criterion for a formula to contain such a definition and provide an effective algorithm to actually retrieve the definition in an applicable form. An implementation within our prover Spass leads to significant performance improvements in application areas where atom definitions are present.
منابع مشابه
Generation of Nonclassical States of the Radiation Field in the System of a Single Trapped Atom in a Cavity within the First Order of the Lamb-Dicke Approximation
In this paper, we propose a theoretical scheme for the generation of non-classical states of the cavity field in a system of a single trapped atom via controlling the Lamb-Dicke parameter. By exploiting the super-operator method, we obtain an analytical expression for the density operator of the system by which we examine the dynamical behaviors of the atomic population inversion, the phase-spa...
متن کاملDependent Types for Nominal Terms with Atom Substitutions
Nominal terms are an extended first-order language for specifying and verifying properties of syntax with binding. Founded upon the semantics of nominal sets, the success of nominal terms with regard to systems of equational reasoning is already well established. This work first extends the untyped language of nominal terms with a notion of non-capturing atom substitution for object-level names...
متن کاملDerivation Procedures for Extended Stable Models
We present derivation proof procedures for extended stable model semantics. Given program II and goal G, G belongs to the well founded model of El iff there is a WFM-derivation for G in II. Likewise, given program II and goal G, G belongs to some extended stable model of II iff there is a XSM-derivation for G in II. Cor-rectness (completeness and soundness) of these procedures is discussed. Exa...
متن کاملConstructing Knowledge Representation Systems with First-Order Formulas as Atoms
This paper proposes a knowledge representation system by extension of the concept of atom. Not only conventional simple atoms, but also atoms representing first-order formulas, which are called formula atoms, are used. By this extension, predicates, logical connectives, and quantifiers may occur in atoms, and can be regarded as objects in the same class, allowing more natural translation from n...
متن کاملSolovay-Type theorems for circular Definitions
We present an extension of the basic revision theory of circular definitions with a unary operator, 2. We present a Fitch-style proof system that is sound and complete with respect to the extended semantics. The logic of the box gives rise to a simple modal logic, and we relate provability in the extended proof system to this modal logic via a completeness theorem, using interpretations over ci...
متن کامل